A DESCENT THEOREM FOR FORMAL SMOOTHNESS

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Notes on Formal Smoothness

The definition of an S-category is proposed by weakening the axioms of a Q-category introduced by Kontsevich and Rosenberg. Examples of Qand S-categories and (co)smooth objects in such categories are given.

متن کامل

Separable Functors and Formal Smoothness

We prove that given a bialgebra surjection π : E → H with nilpotent kernel such that H is a Hopf algebra which is formally smooth as a K-algebra, then π has a section which is a right H-colinear algebra homomorphism. Moreover, if H is also endowed with an ad-invariant integral, then the section can be chosen to be H-bicolinear. We also deal with the dual case. As an application, we prove that e...

متن کامل

Smoothness Theorem for Differential Bv Algebras

Given a differential Batalin-Vilkovisky algebra (V,Q,∆, ·), the associated odd differential graded Lie algebra L := (V,Q + ∆, [ , ]) is always smooth formal. The more interesting consideration is whether the quantum dgLa L~ := (V [[~]],Q+ ~∆, [ , ]) is smooth formal. When it is (for example when a Q-∆ version of the ∂-∂ Lemma holds) there is a weak-Frobenius manifold structure on the homology o...

متن کامل

An improved Proximity =⇒ Smoothness theorem

In this note, we point out that the proximity condition proposed in [8] can be weakened. We reprove the “Proximity ⇒ Smoothness” theorem under the so-called weak proximity condition. This improvement is embarrassingly trivial; and appears to be just an artifact of the authors overlooking a detail during the writing of [8]. But this raises a question: the unnecessarily strong proximity condition...

متن کامل

A Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei

In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nagoya Mathematical Journal

سال: 2016

ISSN: 0027-7630,2152-6842

DOI: 10.1017/nmj.2016.64